Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects

This paper introduces a new communication abstraction, called Set-Constrained Delivery Broadcast (SCD-broadcast), whose aim is to provide its users with an appropriate abstraction level when they have implement objects or distributed tasks in asynchronous message-passing system prone process crash failures. allows each broadcast messages and deliver sequence of sets such way that, if delivers set including message m later m?, no first m? m. After having presented algorithm implementing SCD-broadcast, the investigates programming power computability limits. On “power” side it presents SCD-broadcast-based algorithms, which are both simple efficient, building (such as snapshot conflict-free replicated data types), tasks. “computability limits” shows that SCD-broadcast read/write registers computationally equivalent.